Maximum Cardinality Matching by Evolutionary Algorithms
نویسندگان
چکیده
The analysis of time complexity of evolutionary algorithms has always focused on some artificial binary problems. This paper considers the average time complexity of an evolutionary algorithm for maximum cardinality matching in a graph. It is shown that the evolutionary algorithm can produce matchings with nearly maximum cardinality in average polynomial time.
منابع مشابه
DRAFT - - DRAFT - - DRAFT - - DRAFT - - DRAFT - - 1 Time Complexity of Maximum Matching by an ( N + N ) Evolutionary Algorithm
An (N +N) evolutionary algorithm is considered for the problem of finding the maximum cardinality matching in a graph. It is shown that the performance of the evolutionary algorithm is the same as classical simulated annealing. That is, the evolutionary algorithm cannot find the maximum matching in polynomial average time for a family of bipartite graphs considered in this paper although there ...
متن کاملGPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs
We design, implement, and evaluate GPU-based algorithms for the maximum cardinality matching problem in bipartite graphs. Such algorithms have a variety of applications in computer science, scientific computing, bioinformatics, and other areas. To the best of our knowledge, ours is the first study which focuses on GPU implementation of the maximum cardinality matching algorithms. We compare the...
متن کاملExperiments on Push-Relabel-based Maximum Cardinality Matching Algorithms for Bipartite Graphs
We report on careful implementations of several push-relabel-based algorithms for solving the problem of finding a maximum cardinality matching in a bipartite graph and compare them with fast augmentingpath-based algorithms. We analyze the algorithms using a common base for all implementations and compare their relative performance and stability on a wide range of graphs. The effect of a set of...
متن کاملEfficient algorithms for maximum weight matchings in general graphs with small edge weights
Let G = (V,E) be a graph with positive integral edge weights. Our problem is to find a matching of maximum weight in G. We present a simple iterative algorithm for this problem that uses a maximum cardinality matching algorithm as a subroutine. Using the current fastest maximum cardinality matching algorithms, we solve the maximum weight matching problem in O(W √ nm logn(n /m)) time, or in O(Wn...
متن کاملTwo polynomial algorithms for special maximum matching constructing in trees
For an arbitrary tree we investigate the problems of constructing a maximum matching which minimizes or maximizes the cardinality of a maximum matching of the graph obtained from original one by its removal and present corresponding polynomial algorithms.
متن کامل